Optimal Linear Arrangement of Interval Graphs
نویسندگان
چکیده
We study the optimal linear arrangement (OLA) problem on interval graphs. Several linear layout problems that are NP-hard on general graphs are solvable in polynomial time on interval graphs. We prove that, quite surprisingly, optimal linear arrangement of interval graphs is NP-hard. The same result holds for permutation graphs. We present a lower bound and a simple and fast 2-approximation algorithm based on any interval model of the input graph.
منابع مشابه
An optimal time algorithm for minimum linear arrangement of chord graphs
A linear arrangement / of an undirected graph G = (V,E) with jVj = n nodes is a bijective function /:V ? {0, . . . , n 1}. The cost function is costðG;/Þ 1⁄4 P uv2Ejð/ðuÞ /ðvÞÞj and opt(G) = min"/cost(G,/). The problem of finding opt(G) is called minimum linear arrangement (MINLA). The Minimum Linear Arrangement is an NP-hard problem in general. But there are some classes of graphs optimally so...
متن کاملThe minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 Preliminaries Let F be a family of nonempty sets. The intersection graph of F is obtained by representing each set in F by a vertex and connecting two vertices by an edge if and only if their corresponding sets interse...
متن کاملLinear Arrangement of Halin Graphs
We study the Optimal Linear Arrangement (OLA) problem of Halin graphs, one of the simplest classes of non-outerplanar graphs. We present several properties of OLA of general Halin graphs. We prove a lower bound on the cost of OLA of any Halin graph, and define classes of Halin graphs for which the cost of OLA matches this lower bound. We show for these classes of Halin graphs, OLA can be comput...
متن کاملOptimal one-page tree embeddings in linear time
In the minimum linear arrangement problem one wishes to assign distinct integers to the vertices of a given graph so that the sum of the differences (in absolute value) across the edges of the graph is minimized. This problem is known to be NP-complete for the class of all graphs, but polynomial for trees—algorithms of time complexity O(n2.2) and O(n1.6) were given by Shiloach [SIAM J. Comput. ...
متن کاملThe planar minimum linear arrangement problem is different from the minimum linear arrangement problem
In various research papers, such as [2], one will find the claim that the minLA is optimally solvable on outerplanar graphs, with a reference to [1]. However, the problem solved in that publication, which we refer to as the planar minLA, is different from the minLA, as we show in this article. In constrast to the minimum linear arrangement problem (minLA), the planar minimum linear arrangement ...
متن کامل